An Optimal Bound on the Number of Interior Spike Solutions for the Lin-ni-takagi Problem
نویسندگان
چکیده
We consider the following singularly perturbed Neumann problem ε∆u− u+ u = 0 in Ω, u > 0 in Ω, ∂u ∂ν = 0 on ∂Ω, where p is subcritical and Ω is a smooth and bounded domain in R with its unit outward normal ν. Lin-Ni-Wei [18] proved that there exists ε0 such that for 0 < ε < ε0 and for each integer k bounded by 1 ≤ k ≤ δ(Ω, n, p) (ε| log ε|)n (0.1) where δ(Ω, n, p) is a constant depending only on Ω, p and n, there exists a solution with k interior spikes. We show that the bound on k can be improved to 1 ≤ k ≤ δ(Ω, n, p) εn , (0.2) which is optimal.
منابع مشابه
A full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem
A full Nesterov-Todd (NT) step infeasible interior-point algorithm is proposed for solving monotone linear complementarity problems over symmetric cones by using Euclidean Jordan algebra. Two types of full NT-steps are used, feasibility steps and centering steps. The algorithm starts from strictly feasible iterates of a perturbed problem, and, using the central path and feasi...
متن کاملInterior Bubbling Solutions for the Critical Lin-ni-takagi Problem in Dimension
We consider the problem of finding positive solutions of the problem ∆u − λu + u5 = 0 in a bounded, smooth domain Ω in R3, under zero Neumann boundary conditions. Here λ is a positive number. We analyze the role of Green’s function of −∆+λ in the presence of solutions exhibiting single bubbling behavior at one point of the domain when λ is regarded as a parameter. As a special case of our resul...
متن کاملAn interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function
In this paper, an interior-point algorithm for $P_{ast}(kappa)$-Linear Complementarity Problem (LCP) based on a new parametric trigonometric kernel function is proposed. By applying strictly feasible starting point condition and using some simple analysis tools, we prove that our algorithm has $O((1+2kappa)sqrt{n} log nlogfrac{n}{epsilon})$ iteration bound for large-update methods, which coinc...
متن کاملSeparable programming problems with the max-product fuzzy relation equation constraints
In this paper, the separable programming problem subject to Fuzzy Relation Equation (FRE) constraints is studied. It is decomposed to two subproblems with decreasing and increasing objective functions with the same constraints. They are solved by the maximum solution and one of minimal solutions of its feasible domain, respectively. Their combination produces the original optimal solution. The ...
متن کاملAn improved infeasible interior-point method for symmetric cone linear complementarity problem
We present an improved version of a full Nesterov-Todd step infeasible interior-point method for linear complementarityproblem over symmetric cone (Bull. Iranian Math. Soc., 40(3), 541-564, (2014)). In the earlier version, each iteration consisted of one so-called feasibility step and a few -at most three - centering steps. Here, each iteration consists of only a feasibility step. Thus, the new...
متن کامل